The Stable Embedding Problem
نویسندگان
چکیده
We compute a stable polynomial matrix embedding a stabilizable one. The algorithm resembles the one described by Beelen and Van Dooren for the unimodular embedding problem. We also desribe the numerical problems associated with this kind of algorithms, and point out why the stable embedding algorithm has better prospects than its unimodular counterpart.
منابع مشابه
Phishing website detection using weighted feature line embedding
The aim of phishing is tracing the users' s private information without their permission by designing a new website which mimics the trusted website. The specialists of information technology do not agree on a unique definition for the discriminative features that characterizes the phishing websites. Therefore, the number of reliable training samples in phishing detection problems is limited. M...
متن کاملModel Based Method for Determining the Minimum Embedding Dimension from Solar Activity Chaotic Time Series
Predicting future behavior of chaotic time series system is a challenging area in the literature of nonlinear systems. The prediction's accuracy of chaotic time series is extremely dependent on the model and the learning algorithm. On the other hand the cyclic solar activity as one of the natural chaotic systems has significant effects on earth, climate, satellites and space missions. Several m...
متن کاملA New Optimal Solution Concept for Fuzzy Optimal Control Problems
In this paper, we propose the new concept of optimal solution for fuzzy variational problems based on the possibility and necessity measures. Inspired by the well–known embedding theorem, we can transform the fuzzy variational problem into a bi–objective variational problem. Then the optimal solutions of fuzzy variational problem can be obtained by solving its corresponding biobjective variatio...
متن کاملLinear Sphericity Testing of 3-Connected Single Source Digraphs
It has been proved that sphericity testing for digraphs is an NP-complete problem. Here, we investigate sphericity of 3-connected single source digraphs. We provide a new combinatorial characterization of sphericity and give a linear time algorithm for sphericity testing. Our algorithm tests whether a 3-connected single source digraph with $n$ vertices is spherical in $O(n)$ time.
متن کاملSymmetry aware embedding for shape correspondence
In this paper, we present symmetry-aware embedding for shape correspondence, which is robust against symmetric (left–right) flips and rotational (front–back) flips. Unlike previous embedding approaches that embed surfaces into a high-dimensional space, our technique is based on a low dimensional (3D) embedding. Our method can solve left–right flips by finding a 3D rigid transformation between t...
متن کامل